Preserving the AAIM archives.
نویسنده
چکیده
منابع مشابه
Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set
We consider the relationship of two fixed point theorems for direction-preserving discrete correspondences. We show that, for space of no more than three dimensions, the fixed point theorem [5] of Iimura, Murota and Tamura, on integrally convex sets can be derived from Chen and Deng’s fixed point theorem [1] on lattices by expanding every direction-preserving discrete correspondence over an int...
متن کاملThe Secret Santa Problem
Consider a digraph where the vertices represent people and an arc (i, j) represents the possibility of i giving a gift to j. The basic question we pose is whether there is an anonymity-preserving “gift assignment” such that each person makes and receives exactly one gift, and such that no person i can infer the remaining gift assignments from the fact that i is assigned to give a gift to j. We ...
متن کاملFinding Faithful Boyce-Codd Normal Form Decompositions
It is well known that faithful (i.e. dependency preserving) decompositions of relational database schemas into Boyce-Codd Normal Form (BCNF) do not always exist, depending on the set of functional dependencies given, and that the corresponding decision problem is NPhard. The only algorithm to guarantee both faithfulness and BCNF (if possible) proposed so far in [Os79] is a brute-force approach ...
متن کاملThe Complexity of Degree Anonymization by Vertex Addition
Motivated by applications in privacy-preserving data publishing, we study the problem of making an undirected graph k-anonymous by adding few vertices (together with some incident edges). That is, after adding these “dummy vertices”, for every vertex degree d appearing in the resulting graph, there shall be at least k vertices with degree d. We explore three variants of vertex addition (justifi...
متن کاملEfficient Algorithms for the Order Preserving Pattern Matching Problem
Given a pattern x of length m and a text y of length n, both over an ordered alphabet, the order-preserving pattern matching problem consists in finding all substrings of the text with the same relative order as the pattern. It is an approximate variant of the well known exact pattern matching problem which has gained attention in recent years. This interesting problem finds applications in a l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of insurance medicine
دوره 34 1 شماره
صفحات -
تاریخ انتشار 2002